Valuation Equilibria
نویسنده
چکیده
We introduce a new solution concept for games in extensive form with perfect information: the valuation equilibrium. The moves of each player are partitioned into similarity classes. A valuation of the player is a real valued function on the set of her similarity classes. At each node a player chooses a move that belongs to a class with maximum valuation. The valuation of each player is consistent with the strategy profile in the sense that the valuation of a similarity class is the player expected payoff given that the path (induced by the strategy profile) intersects the similarity class. The solution concept is applied to decision problems and multi-player extensive form games. It is contrasted with existing solution concepts. An aspiration-based approach is also proposed, in which the similarity partitions are determined endogenously. The corresponding equilibrium is called the aspiration-based valuation equilibrium (ASVE). While the Subgame Perfect Nash Equilibrium is always an ASVE, there are other ASVE in general. But, in zero-sum two-player games without chance moves every player must get her value in any ASVE.
منابع مشابه
All Nash Equilibria of the Multi-Unit Vickrey Auction∗
This paper completely characterizes the set of Nash equilibria of the Vickrey auction for multiple identical units when buyers have non-increasing marginal valuations and there at least three potential buyers. There are two types of equilibria: In the first class of equilibria there are positive bids below the maximum valuation. In this class, above a threshold value all bidders bid truthfully ...
متن کاملAll equilibria of the multi-unit Vickrey auction
This paper completely characterizes the set of equilibria of the Vickrey auction for multiple identical units when buyers have non-increasing marginal valuations and there are at least three potential buyers. There are two types of equilibria: In the first class of equilibria there are positive bids below the maximum valuation. In this class, above a threshold value all bidders bid truthfully o...
متن کاملModeling House Values: Extremal Equilibria in Allocation Markets with Non-Transferable Utility
Wealth effects impact the valuation and allocation of large indivisible goods such as houses. Yet no general method exists for quantifying these effects. We introduce an algorithm for identifying equilibria in allocation markets with non-transferable utility, thereby filling this gap. In cases with multiple equilibria, the algorithm can be used to solve for maximum and minimum equilbrium prices...
متن کاملMultiagent resource allocation with sharable items: simple protocols and Nash equilibria
We study a particular multiagent resource allocation problem with indivisible, but sharable resources. In our model, the utility of an agent for using a bundle of resources is the difference between the valuation of that bundle and a congestion cost (or delay), a figure formed by adding up the individual congestion costs of each resource in the bundle. The valuation and the delay can be agent-d...
متن کاملEfficiency Bounds for Sequential Wireless Resource Allocation Auctions
A sequential auction mechanism is proposed for sharing a wireless resource (bandwidth or power) among competing transmitters. The resource is assumed to be managed by a spectrum broker (auctioneer), who collects bids and allocates sequentially discrete units of the resource via second-price auctions. It is known that such auctions can have inefficient equilibria. For two users with full informa...
متن کاملFirst Price Auctions with Participation Costs∗
This paper studies equilibria of first price auctions with participation costs in the independent private values environment. We focus on the cutoff strategies in which each bidder participates and submits a bid if his value is greater than or equal to a critical value, the cutoff point. It is shown that, when bidders are homogenous, there always exists a symmetric equilibrium, and further, tha...
متن کامل